- Hamming radius
- радиус Хемминга (в теории кодирования: максимальное расстояние между центром шара Хемминга и элементом этого шара)
Англо-русский словарь промышленной и научной лексики. 2014.
Hamming radius
Смотреть что такое "Hamming radius" в других словарях:
Hamming bound — In mathematics and computer science, in the field of coding theory, the Hamming bound is a limit on the parameters of an arbitrary block code: it is also known as the sphere packing bound or the volume bound from an interpretation in terms of… … Wikipedia
Hamming-Schranke — Ein perfekter Code, oder auch dicht gepackter Code, bezeichnet in der Codierungstheorie einen Blockcode , bei dem jedes Wort nur zu genau einem Codewort eine minimale Hamming Distanz hat. Bei der für gewöhnlich verwendeten Maximum Likehood… … Deutsch Wikipedia
Linear code — In mathematics and information theory, a linear code is an important type of block code used in error correction and detection schemes. Linear codes allow for more efficient encoding and decoding algorithms than other codes (cf. syndrome… … Wikipedia
E₈ lattice — In mathematics, the E8 lattice is a special lattice in R8. It can be characterized as the unique positive definite, even, unimodular lattice of rank 8. The name derives from the fact that it is the root lattice of the E8 root system. The normIn… … Wikipedia
Isoperimetric inequality — The isoperimetric inequality is a geometric inequality involving the square of the circumference of a closed curve in the plane and the area of a plane region it encloses, as well as its various generalizations. Isoperimetric literally means… … Wikipedia
Error detection and correction — In mathematics, computer science, telecommunication, and information theory, error detection and correction has great practical importance in maintaining data (information) integrity across noisy channels and less than reliable storage… … Wikipedia
Covering code — In coding theory, a covering code is an object satisfying a certain mathematical property: A code of length n over Q is an R covering code if for every word of Qn there is a codeword such that their Hamming distance is . Contents 1 Definition 2… … Wikipedia
Mathematics and Physical Sciences — ▪ 2003 Introduction Mathematics Mathematics in 2002 was marked by two discoveries in number theory. The first may have practical implications; the second satisfied a 150 year old curiosity. Computer scientist Manindra Agrawal of the… … Universalium
Gilbert-Varshamov bound — The Gilbert Varshamov bound is a bound on the parameters of a (not necessarily linear) code. It is occasionally known as the Gilbert Shannon Varshamov bound (or the GSV bound ), but the Gilbert Varshamov bound is by far the most popular… … Wikipedia
Deriving the volume of an n-ball — In geometry, the volume of a sphere is a special case of the n dimensional volume of a ball in n dimensional Euclidean space. Contents 1 Derivation of the volume of an n ball 1.1 Base cases 1.2 General case … Wikipedia
Distance — This article is about distance in the mathematical or physical sense. For other senses of the term, see distance (disambiguation). Proximity redirects here. For the 2001 film, see Proximity (film). Distance (or farness) is a numerical description … Wikipedia
